Nearly Optimal Sparse Polynomial Multiplication
نویسندگان
چکیده
منابع مشابه
(Nearly) Sample-Optimal Sparse Fourier Transform
We consider the problem of computing a k-sparse approximation to the discrete Fourier transform of an n-dimensional signal. Our main result is a randomized algorithm that computes such an approximation using O(k log n(log log n)) signal samples in time O(k log n(log log n)), assuming that the entries of the signal are polynomially bounded. The sampling complexity improves over the recent bound ...
متن کاملOptimal Complexity Lower Bound for Polynomial Multiplication
We prove lower bounds of order n logn for both the problem of multiplying polynomials of degree n, and of dividing polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower bounds are optimal up to order of magnitude. The proof uses a recent idea of R. Raz [Proc. 34th STOC 2002] proposed for matrix multiplication. It reduces the li...
متن کاملOptimal and Nearly Optimal Algorithms for Approximating Polynomial Zeros
K e y w o r d s C o m p l e x polynomial zeros, Approximation, Polynomial factorization, Parallel algorithms, Computational complexity, Sequential algorithms. 1. I N T R O D U C T I O N 1.1. T h e Subject , Some History, and a S u m m a r y of Our Resul ts The problem of solving a polynomial equation p ( x ) = 0 substantially motivated the development of mathematics throughout the centuries. As...
متن کاملOn the bit-complexity of sparse polynomial multiplication
In this paper, we present fast algorithms for the product of two multivariate polynomials in sparse representation. The bit complexity of our algorithms are studied in detail for various types of coefficients, and we derive new complexity results for the power series multiplication in many variables. Our algorithms are implemented and freely available within the Mathemagix software. We show tha...
متن کاملOn the bit-complexity of sparse polynomial and series multiplication
In this paper we present various algorithms for multiplying multivariate polynomials and series. All algorithms have been implemented in the C++ libraries of the Mathemagix system. We describe naive and softly optimal variants for various types of coefficients and supports and compare their relative performances. For the first time we are able to observe the benefit of non naive arithmetic for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2020.2989385